k-NLC graphs and polynomial algorithms

k-NLC Graphs and Polynomial Algorithms

The Laplacian Polynomial and Kirchhoff Index of the k-th‎ Semi Total Point Graphs

The k-th semi total point graph of a graph G, , ‎is a graph‎ obtained from G by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎In this paper‎, a formula for Laplacian polynomial of in terms of‎ characteristic and Laplacian polynomials of G is computed‎, ‎where is a connected regular graph‎.The Kirchhoff index of is also computed‎.

Algorithms for Glushkov K-graphs

The automata arising from the well known conversion of regular expression to non deterministic automata have rather particular transition graphs. We refer to them as the Glushkov graphs, to honour his nice expression-to-automaton algorithmic short cut [10]. The Glushkov graphs have been characterized [6] in terms of simple graph theoretical properties and certain reduction rules. We show how to...

the laplacian polynomial and kirchhoff index of the k-th‎ semi total point graphs

the k-th semi total point graph of a graph g, , ‎is a graph‎ obtained from g by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎in this paper‎, a formula for laplacian polynomial of in terms of‎ characteristic and laplacian polynomials of g is computed‎, ‎where is a connected regular graph‎.the kirchhoff index of is also computed‎.

Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications

ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...